Path Rewriting and Combined Word Problems
نویسندگان
چکیده
We give an algorithm solving combined word problems (over non necessarily disjoint signatures) based on rewriting of equivalence classes of terms. The canonical rewriting system we introduce consists of few transparent rules and is obtained by applying Knuth-Bendix completion procedure to presentations of pushouts among categories with products. It applies to pairs of theories which are both constructible over their common reduct (on which we do not make any special assumption). ∗Lavoro svolto nell’ambito del progetto MURST “Logica”.
منابع مشابه
LEC: Learning Driven Data-path Equivalence Checking
In the LEC system, we employ a learning-driven approach for solving combinational data-path equivalence checking problems. The data-path logic is specified using Boolean and word-level operators in VHDL/Verilog. The targeted application area are Cto-RTL equivalence checking problems found in an industrial setting. These are difficult because of the algebraic transformations done on the data-pat...
متن کاملCombining word problems through rewriting in categories with products
We give an algorithm solving combined word problems (over non-necessarily disjoint signatures) based on rewriting of equivalence classes of terms. The canonical rewriting system we introduce consists of few transparent rules and is obtained by applying Knuth–Bendix completion procedure to presentations of pushouts among categories with products. It applies to pairs of theories which are both co...
متن کاملRewriting Methods for Word Problems
This paper outlines various recent approaches to solving word problems. Term orderings are used to de ne a terminating rewrite relation. When con uent, that relation de nes unique normal forms that can be used to decide word problems. Some results obtained by these methods are summarized.
متن کاملImproving Local Search for Bit-Vector Logics in SMT with Path Propagation
Bit-blasting is the main approach for solving word-level constraints in SAT Modulo Theories (SMT) for bit-vector logics. However, in practice it often reaches its limits, even if combined with sophisticated rewriting and simplification techniques. In this paper, we extended a recently proposed alternative based on stochastic local search (SLS) and improve neighbor selection based on down propag...
متن کاملInnnite Convergent String-rewriting Systems and Cross-sections for Monoids
A nitely presented monoid has a decidable word problem if and only if it can be presented by some left-recursive convergent string-rewriting system if and only if it has a recursive cross-section. However, context-free cross-sections or even regular cross-sections do not suuce. This is shown by presenting examples of nitely presented monoids with decidable word problems that do not admit regula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000